CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages

Are propagating scattered context grammars as powerful as context sensitive grammars? This question customarily referred to as the L (PSCG) = L (CS) (see [4]) problem, represents a long standing open problem in formal language theory. The present paper reformulates and answers this question in terms of CD grammar systems. More precisely, the paper introduces CD grammar systems whose components ...

متن کامل

On the Generative Power of CD Grammar Systems With Scattered Context Components

There is a long time open problem regarding the generative power of scattered context grammars without erasing rules. This problem tries to compare their generative power with context-sensitive grammars. In this paper, modified version of this problem will be presented. This modified version combines scattered context grammars with another model — grammar systems. It will be shown that when con...

متن کامل

Two Characterizations of the Context-Sensitive Languages

An n-dimensional bug-automation is generalization of a finite stateacceptor to n-dimensions. With each bug B, we associate the language L(B)which is the set of top rows of n-dimensional rectangular arrays accepted by B.One-dimensional bugs define trivially the regular sets. Two-dimensional bugsdefine precisely the context-sensitive languages, while bugs of dimension 3 orgrea...

متن کامل

On Context-Free Languages of Scattered Words

It is known that if a Büchi context-free language (BCFL) consists of scattered words, then there is an integer n, depending only on the language, such that the Hausdorff rank of each word in the language is bounded by n. Every BCFL is a Müller context-free language (MCFL). In the first part of the paper, we prove that an MCFL of scattered words is a BCFL iff the rank of every word in the langua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science

سال: 2017

ISSN: 2075-2180

DOI: 10.4204/eptcs.252.17